Towards Tractable Inference for Resource-Bounded Agents
نویسندگان
چکیده
For a machine to act with common sense, it is not enough that information about commonsense things be written down in a formal language. What actual knowledge—i.e. conclusions available for informing actions—a formalization is meant to provide cannot be determined without some specification of what sort of reasoning is expected. The traditional view in epistemic logic says that agents see all logical consequences of the information they have, but that would give agents capabilities far beyond common sense or what is physically realizable. To work towards addressing this issue, we introduce a new epistemic logic, based on a three-valued version of neighborhood semantics, which allows for talking about the effort used in making inferences. We discuss the advantages and limitations of this approach and suggest that the ideas used in it could also find a role in autoepistemic reasoning.
منابع مشابه
Classical Logic, Argumentation and Dialectic
A well studied instantiation of Dung’s abstract theory of argumentation yields argumentation-based characterisations of non-monotonic inference over possibly inconsistent sets of classical formulae. This provides for single-agent reasoning in terms of argument and counter-argument, and distributed non-monotonic reasoning in the form of dialogues between computational and or human agents. Howeve...
متن کاملBounded Conditioning: Flexible Inference for Decisions under Scarce Resources
We introduce a graceful approach to probabilistic inference called bounded conditioning. Bounded conditioning monotonically refines the bounds on posterior probabilities in a belief network with computation, and converges on final probabilities of interest with the allocation of a complete resource fraction. The approach allows a reasoner to exchange arbitrary quantities of computational resour...
متن کاملTowards a Decidable LogicWeb via Length-Bounded Derivations
LogicWeb has traditionally lacked devices for dealing with intractable queries. We address this limitation by adopting length-bounded inference, a form of approximate reasoning. A length-bounded inference is of the form pv(P, G, n) which is a success if a query G can be proved from the web page P within n proof steps. It thus makes LogicWeb decidable and more tractable. During the process, we p...
متن کاملBelief ascription under bounded resources
There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, namely, on the ascription of beliefs and inference rules by the agents to each other. We present a formal model of a system of bounded reasoners which reason about each other’s beliefs, and investigate the problem of b...
متن کاملTractable Bayesian Network Structure Learning with Bounded Vertex Cover Number
Both learning and inference tasks on Bayesian networks are NP-hard in general. Bounded tree-width Bayesian networks have recently received a lot of attention as a way to circumvent this complexity issue; however, while inference on bounded tree-width networks is tractable, the learning problem remains NP-hard even for tree-width 2. In this paper, we propose bounded vertex cover number Bayesian ...
متن کامل